Zeszyty Naukowe Politechniki Białostockiej. Informatyka the Comparison of Genetic Algorithms Which Solve Orienteering Problem Using Complete and Incomplete Graph
نویسندگان
چکیده
The purpose of this work was to compare two forms of genetic algorithm (complete and incomplete graph version) which solves Orienteering Problem (OP). While in most papers concerning OP graph is complete and satisfies triangle inequality, in our versions such assumptions may not be satisfied. It could be more practical as transport networks are graphs which do not have to satisfy those conditions. In such cases, graphs are usually complemented with fictional edges before they can be used by classic OP solving algorithms which operate on complete graphs. This paper answers the question: Is it better (in terms of results quality and time consumption) to transform graphs to classic OP form before running algorithm (complete graph version) or to solve OP on graphs without any assumptions and changes (incomplete graph version)? The computer experiment was conducted on the real transport network in Poland and its results suggest that it is worth checking both versions of the algorithm on concrete networks.
منابع مشابه
Zeszyty Naukowe Politechniki Białostockiej. Informatyka an Algorithm for Generating Binary Pseudo-random Sequences
In the paper it is presented an algorithm for generating pseudo-random binary sequences. There are formulated theorems concerning properties of the sequence generated by the algorithm. The sequence is not periodic. Moreover, for any natural number n > 0, the initial fragment of the generated sequence of the length (2 · n) · 2(2·n) contains all (binary) series of the length n.
متن کاملZeszyty Naukowe Politechniki Białostockiej. Informatyka an Improved Approximation Algorithm for Optimal Routes Generation in Public Transport Network
This paper presents a new version of Routes Generation Matrix Algorithm, called Routes Generation Matrix Improved Algorithm (RGMIA), for determining routes with optimal travel time in public transport network. The method was implemented and tested on the real public transport network in Warsaw city. This network was completed with walk links and therefore resultant routes are more practical and...
متن کاملZeszyty Naukowe Politechniki Białostockiej. Informatyka an Improved Genetic Algorithm for Solving the Selective Travelling Salesman Problem on a Road Network
The Selective Travelling Salesman Problem (STSP) is a modified version of the Travelling Salesman Problem (TSP) where it is not necessary to visit all vertices. Instead of it, with each vertex a number meaning a profit is associated. The problem is to find a cycle which maximizes collected profit but does not exceed a given cost constraint. A direct application of the STSP, e.g. in Intelligent ...
متن کاملZeszyty Naukowe Politechniki Białostockiej. Informatyka Learning Finite Gaussian Mixtures Using Differential Evolution
In the paper the problem of parameter estimation of finite mixture of multivariate Gaussian distributions is considered. A new approach based on differential evolution (DE) algorithm is proposed. In order to avoid problems with infeasibility of chromosomes our version of DE uses a novel representation, in which covariance matrices are encoded using their Cholesky decomposition. Numerical experi...
متن کاملZeszyty Naukowe Politechniki Białostockiej. Informatyka Passive Sound Source Localization System
Acoustic source localization system for speech signals based on five microphone array was developed. Three dimensional position computation is based on time delay estimation between pairs of microphones. The psyhoacoustically motivated voice activity detector was used to robustly determine activity of speaker in presence of background noise. The detector was based on modulation properties of hu...
متن کامل